Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Optimum
نویسندگان
چکیده
Landscape theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of a special kind of landscapes called elementary landscapes. The decomposition of the objective function of a problem into its elementary components can be exploited to compute summary statistics. We present closed-form expressions for the fitness-distance correlation (FDC) based on the elementary landscape decomposition of the problems defined over binary strings in which the objective function has one global optimum. We present some theoretical results that raise some doubts on using FDC as a measure of problem difficulty.
منابع مشابه
An Analysis of the Fitness Landscape of Travelling Salesman Problem
The fitness landscape of the travelling salesman problem is investigated for 11 different types of the problem. The types differ in how the distances between cities are generated. Many different properties of the landscape are studied. The properties chosen are all potentially relevant to choosing an appropriate search algorithm. The analysis includes a scaling study of the time to reach a loca...
متن کاملOn Functions with a Fixed Fitness Versus Distance-to-Optimum Relation
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the correlation value cannot be reliably related to landscape difficulty, we investigate in this paper whether an interpretation of the correlation plot can yield reliable information about the behavior of the GA. Our approach is as foll...
متن کاملOn functions with a given fitness–distance relation
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC) value cannot be reliably related to landscape difficulty, we investigate whether an interpretation of the whole correlation plot can yield reliable information about the behavior of the GA. Our appr...
متن کاملOn fitness distance distributions and correlations, GA performance, and population size of fitness functions with translated optima
Fitness distance correlation has been proposed as an analysis tool for the fitness function landscape of genetic algorithms. It has been shown that it works in some cases, but there are also counterexamples. We studied the fitness distance correlation and the optimal population size by two fitness functions with a translational minimum and with a meta-genetic algorithm. We discovered that the f...
متن کاملGeneral Lower Bounds for the Running Time of Evolutionary Algorithms
We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities between fitness levels. The method yields exact or near-exact lower bounds for LO, OneMax, and all functions with a unique optimum. All lower bounds hold for every evolutionary algorithm that only uses standard mutation as variatio...
متن کامل